Decomposition of a Graph into Two Disjoint Odd Subgraphs
نویسندگان
چکیده
منابع مشابه
On vertex-disjoint complete subgraphs of a graph
We conjecture that if G is a graph of order sk, where s ~3 and k 2: 1 are integers, and d(x)+d(y) ~ 2(s-1)k for every pair of non-adjacent vertices x and y of G, then G contains k vertex-disjoint complete subgraphs of order s. This is true when s = 3, [6]. Here we prove this conjecture for k ~ 6.
متن کاملOn Partitioning a Graph into Two Connected Subgraphs
Suppose a graph G is given with two vertex-disjoint sets of vertices Z1 and Z2. Can we partition the remaining vertices of G such that we obtain two connected vertex-disjoint subgraphs of G that contain Z1 and Z2, respectively? This problem is known as the 2-Disjoint Connected Subgraphs problem. It is already NP-complete for the class of n-vertex graphs G = (V, E) in which Z1 and Z2 each contai...
متن کاملCovering the edges of a graph by three odd subgraphs
We prove that any finite simple graph can be covered by three of its odd subgraphs, and we construct an infinite sequence of graphs where an edge-disjoint covering by three odd subgraphs is not possible. c © ??? John Wiley & Sons, Inc.
متن کاملDecomposing a Graph Into Expanding Subgraphs
A paradigm that was successfully applied in the study of both pure and algorithmic problems in graph theory can be colloquially summarized as stating that any graph is close to being the disjoint union of expanders. Our goal in this paper is to show that in several of the instantiations of the above approach, the quantitative bounds that were obtained are essentially best possible. Three exampl...
متن کاملPartitioning a graph into degenerate subgraphs
Let G = (V,E) be a graph with maximum degree k ≥ 3 distinct from Kk+1. Given integers s ≥ 2 and p1, . . . , ps ≥ 0, G is said to be (p1, . . . , ps)-partitionable if there exists a partition of V into sets V1, . . . , Vs such that G[Vi] is pi-degenerate for i ∈ {1, . . . , s}. In this paper, we prove that we can find a (p1, . . . , ps)-partition of G in O(|V |+|E|)-time whenever 1 ≥ p1, . . . ,...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Graphs and Combinatorics
سال: 2018
ISSN: 0911-0119,1435-5914
DOI: 10.1007/s00373-018-1970-0